/*
 * @Date: 2021-09-09 15:20:01
 * @Author: Acckno1
 * @LastEditTime: 2021-09-09 15:29:39
 * @Description: 
 */
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}


string add_large_num(string a, string b)
{
    int e = 0, len = a.size();
    string res = "";
    for (int i = len - 1; i >= 0; i--)
    {
        int t = (a[i] - '0') + (b[i] - '0') + e;
        if (t >= 10)
        {
            res += t % 10 + '0';
            e = t / 10;
        }
        else
        {
            res += t + '0';
            e = 0;
        }
    }
    if (e != 0)
        res += e + '0';
    reverse(res.begin(), res.end());
    return res;
}

bool is_palindrome(string s) {
    int l = 0, r = s.size() - 1;
    while (l <= r) {
        if (s[l] != s[r]) return false;
        l ++ ;
        r -- ;
    }
    return true;
}

inline void solution() {
    string s, r;
    cin >> s;
    int cnt = 0;
    while (!is_palindrome(s) && cnt < 10) {
        cnt ++ ;
        r = s;
        reverse(r.begin(), r.end());
        cout << s << " + " << r << " = ";
        s = add_large_num(r, s);
        cout << s << endl;
    }
    if (cnt < 10) cout << s << " is a palindromic number." << endl;
    else cout << "Not found in 10 iterations." << endl;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}